A tensor compression algorithm using Tucker decomposition and dictionary dimensionality reduction

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time

Abstract. We consider Tucker-like approximations with an r × r × r core tensor for threedimensional n×n×n arrays in the case of r ¿ n and possibly very large n (up to 104−106). As the approximation contains only O(rn + r3) parameters, it is natural to ask if it can be computed using only a small amount of entries of the given array. A similar question for matrices (two-dimensional tensors) was ...

متن کامل

Bayesian Sparse Tucker Models for Dimension Reduction and Tensor Completion

Tucker decomposition is the cornerstone of modern machine learning on tensorial data analysis, which have attracted considerable attention for multiway feature extraction, compressive sensing, and tensor completion. The most challenging problem is related to determination of model complexity (i.e., multilinear rank), especially when noise and missing data are present. In addition, existing meth...

متن کامل

User Recommendations based on Tensor Dimensionality Reduction

Social Tagging is the process by which many users add metadata in the form of keywords, to annotate and categorize items (songs, pictures, web links, products etc.). Social tagging systems (STSs) can recommend users with common social interest based on common tags on similar items. However, users may have different interests for an item, and items may have multiple facets. In contrast to the cu...

متن کامل

Dimensionality Reduction Using a Randomized Projection Algorithm: Preliminary Results

We describe an implementation and experiments with a low-distortion randomized projection algorithm [LINI94] that can reduce the number of dimensions in the data by a considerable amount. The performance of the randomized algorithm is compared with that of a popular technique---Principal Component Analysis (PCA). The experiments show that the randomized projection algorithm consistently outperf...

متن کامل

Compression of Simulation Results Database Using Tensor Decomposition

With the current trend of globalization, product design and development is often conducted collaboratively among several divisions, thus making it a huge challenge to transfer large CAE (Computer Aided Engineering) data between different locations. In this study, we have developed a data compression method based on TD (Tensor Decomposition). In this method, voxel simulation results data are rep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Distributed Sensor Networks

سال: 2020

ISSN: 1550-1477,1550-1477

DOI: 10.1177/1550147720916408